-
1 representable algebra
Большой англо-русский и русско-английский словарь > representable algebra
-
2 representable algebra
Математика: представимая алгебра -
3 representable algebra
мат.English-Russian scientific dictionary > representable algebra
-
4 representable
представимый, изобразимый analytically representable function ≈ аналитически представимая функция completely representable predicate ≈ полностью представимый предикат numeralwise [numerically] representable ≈ нумерически представимый numeralwise representable formula ≈ нумерически представимая формула numeralwise representable function ≈ нумерически представимая функция recursively representable operation ≈ рекурсивно представимая операция recursively representable relation ≈ рекурсивно представимое отношение sourcewise representable function ≈ истокообразно представленная функция uniquely representable graph ≈ однозначно представимый граф weakly representable predicate ≈ слабо представимый предикат - analytically representable - nomographically representable - properly representable - recursively representable - representable algebra - representable event - representable function - representable functor - representable integer - representable predicate - strongly representable - totally representable - uniquely representable - weakly representable ПредставимоБольшой англо-русский и русско-английский словарь > representable
-
5 algebra
algebra with minimality condition — алгебра с условием минимальности, алгебра с условием обрыва убывающих цепей
algebra with maximality condition — алгебра с условием максимальности, алгебра с условием обрыва возрастающих цепей
-
6 представимая алгебра
Большой англо-русский и русско-английский словарь > представимая алгебра
См. также в других словарях:
Relation algebra — is different from relational algebra, a framework developed by Edgar Codd in 1970 for relational databases. In mathematics, a relation algebra is a residuated Boolean algebra supporting an involutary unary operation called converse. The… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Goodman-Nguyen-van Fraassen algebra — A Goodman Nguyen van Fraassen algebra is a type of conditional event algebra (CEA) that embeds the standard Boolean algebra of unconditional events in a larger algebra which is itself Boolean. The goal (as with all CEAs) is to equate the… … Wikipedia
Invariante algebraico (álgebra lineal) — Un invariante algebraico es una función polinómica de las componentes de la matriz de una aplicación lineal, no depende de la base vectorial escogida para representar la aplicación lineal en forma de matriz. En otras palabras, un invariante… … Wikipedia Español
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Congruence lattice problem — In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed by Robert P. Dilworth, and for many years it was one of the most … Wikipedia
Subdirect product — In mathematics, especially in the areas of abstract algebra known as universal algebra, group theory, ring theory, and module theory, a subdirect product is a subalgebra of a direct product that depends fully on all its factors without however… … Wikipedia
Subdirect irreducible — In algebra, a subdirect irreducible is an algebra that cannot be factored as a subdirect product of simpler algebras. Subdirect irreducibles play a somewhat analogous role in algebra to primes in number theory. TOC =Definition=In algebra, a… … Wikipedia
Functor — For functors as a synonym of function objects in computer programming to pass function pointers along with its state, see function object. For the use of the functor morphism presented here in functional programming see also the fmap function of… … Wikipedia